HAPLO-ASP: Haplotype Inference Using Answer Set Programming
نویسندگان
چکیده
Identifying maternal and paternal inheritance is essential to be able to find the set of genes responsible for a particular disease. However, due to technological limitations, we have access to genotype data (genetic makeup of an individual), and determining haplotypes (genetic makeup of the parents) experimentally is a costly and time consuming procedure. With these biological motivations, we study haplotype inference—determining the haplotypes that form a given set of genotypes—using Answer Set Programming; we call our approach HAPLO-ASP. This note summarizes the range of problems that can be handled by HAPLO-ASP, and its applicability and effectiveness on real data in comparison with the other existing approaches.
منابع مشابه
Comparing ASP, CP, ILP on two Challenging Applications: Wire Routing and Haplotype Inference
We study three declarative programming paradigms, Answer Set Programming (ASP), Constraint Programming (CP), and Integer Linear Programming (ILP), on two challenging applications: wire routing and haplotype inference. We represent these problems in each formalism in a systematic way, compare the formulations both from the point of view of knowledge representation (e.g., how tolerant they are to...
متن کاملEfficient Haplotype Inference with Answer Set Programming
Identifying maternal and paternal inheritance is essential to be able to find the set of genes responsible for a particular disease. Although we have access to genotype data (genetic makeup of an individual), determining haplotypes (genetic makeup of the parents) experimentally is a costly and time consuming procedure due to technological limitations. With these biological motivations, we study...
متن کاملComparing ASP, CP, ILP on Haplotype Inference by Pure Parsimony
We study three declarative programming paradigms, Answer Set Programming (ASP), Constraint Programming (CP), and Integer Linear Programming (ILP), on a challenging application: Haplotype Inference by Pure Parsimony (HIPP). We represent HIPP in each formalism in a systematic way, compare the formulations both from the point of view of knowledge representation (e.g., how easy it is to represent s...
متن کاملProlog and ASP Inference under One Roof
Answer set programming (ASP) is a declarative programming paradigm stemming from logic programming that has been successfully applied in various domains. Despite amazing advancements in ASP solving, many applications still pose a challenge that is commonly referred to as grounding bottleneck. Devising, implementing, and evaluating a method that alleviates this problem for certain application do...
متن کاملSystems integrating answer set programming and constraint programming
We will demonstrate two systems implementing subclasses of a new language AC(C). The language AC(C) not only has the problem modeling power of both Answer Set Prolog (ASP) and Constraint Logic Programming (CLP) but also allows for more efficient inference algorithms combining reasoning techniques from ASP and CLP systems.
متن کامل